Edges not in any monochromatic copy of a fixed graph
نویسندگان
چکیده
منابع مشابه
On edges not in monochromatic copies of a fixed bipartite graph
Let H be a fixed graph. Denote f(n,H) to be the maximum number of edges not contained in any monochromatic copy of H in a 2-edge-coloring of the complete graph Kn, and ex(n,H) to be the Turán number of H . An easy lower bound shows f(n,H) ≥ ex(n,H) for any H and n. In [9], Keevash and Sudakov proved that if H is an edge-color-critical graph or C4, then f(n,H) = ex(n,H) holds for large n, and th...
متن کاملOn the number of edges not covered by monochromatic copies of a fixed graph
For a fixed graph H; let f ðn;HÞ denote the maximum possible number of edges not belonging to a monochromatic copy of H in a 2-edge-coloring of the complete graph of order n: Let exðn;HÞ be the Turán number of H; i.e., the maximum number of edges that a graph on n vertices can have without containing a copy of H: An easy lower bound of f ðn;HÞXexðn;HÞ follows from the 2-edge-coloring in which t...
متن کاملSimultaneous Graph Embeddings with Fixed Edges
We study the problem of simultaneously embedding several graphs on the same vertex set in such a way that edges common to two or more graphs are represented by the same curve. This problem is known as simultaneously embedding graphs with fixed edges. We show that this problem is closely related to the weak realizability problem: Can a graph be drawn such that all edge crossings occur in a given...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series B
سال: 2019
ISSN: 0095-8956
DOI: 10.1016/j.jctb.2018.07.007